on trees and the multiplicative sum zagreb index
نویسندگان
چکیده
for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb indeces among all trees of order $ngeq 13$.
منابع مشابه
On trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کاملOn the Multiplicative Zagreb Indices of Bucket Recursive Trees
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consi...
متن کاملTrees, Unicyclic, and Bicyclic Graphs Extremal with Respect to Multiplicative Sum Zagreb Index∗
For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as M1(G) = ∑ v∈V (G) dG(v) 2 where dG(v) is the degree of vertex v in G. The alternative expression for M1(G) is ∑ uv∈E(G)(dG(u)+dG(v)). Very recently, Eliasi, Iranmanesh and Gutman [7] introduced a new graphical invariant ∏∗ 1(G) = ∏ uv∈E(G)(dG(u) + dG(v)) as the multiplicative version of ...
متن کاملMultiplicative Zagreb Indices of Trees
Let G be a graph with vertex set V (G) and edge set E(G) . The first and second multiplicative Zagreb indices of G are Π1 = ∏ x∈V (G) deg(x) 2 and Π2 = ∏ xy∈E(G) deg(x) deg(y) , respectively, where deg(v) is the degree of the vertex v . Let Tn be the set of trees with n vertices. We determine the elements of Tn , extremal w.r.t. Π1 and Π2 . AMS Mathematics Subject Classification (2000): 05C05, ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملordering of trees by multiplicative second zagreb index
for a graph $g$ with edge set $e(g)$, the multiplicative second zagreb index of $g$ is defined as $pi_2(g)=pi_{uvin e(g)}[d_g(u)d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$. in this paper, we identify the eighth class of trees, with the first through eighth smallest multiplicative second zagreb indeces among all trees of order $ngeq 14$.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
communication in combinatorics and optimizationجلد ۱، شماره ۲، صفحات ۱۳۷-۱۴۸
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023